Random Walks with Decreasing Steps
نویسنده
چکیده
We consider a one-dimensional random walk beginning at the origin and moving ± cn at time n. If ∑ cn < ∞ then with probability one the random walk has a final location. We describe the distribution of the final location and find the cumulants and the moments in terms of the power sums of the step sizes. Some interesting definite integrals involving infinite products of trigonometric functions can be evaluated probabilistically. Similar results hold for random walks with steps chosen uniformly in [−bn, bn], assuming that ∑ bn <∞. 1 Harmonic Random Walk Imagine a random walker who is not only staggering but also tiring. In contrast to a simple random walker who takes steps of equal length but random direction, our harmonic random walker first takes a step of length 1, then a step of length 1/2, then a step of length 1/3, and so on. As in a simple random walk the direction of each step is equally likely to be left as right and independent of the other steps. Assume the walk begins at the origin at time zero. What is the distribution of the location as time goes to infinity? For the simple random walk the location at time n has a binomial distribution with variance n (assuming steps of unit length), and so there is not a limiting distribution unless rescaling is done as in the Central Limit Theorem in which the location at time n is scaled to units of √ n so that the distribution tends to a standard normal distribution. However, the harmonic random walk does have a limiting distribution for the location as time goes to infinity, as do many other random walks with variable steps. The fundamental probability space Ω consists of countable binary sequences to represent the sequence of left-right choices in a random walk. We identify Ω with the interval [0, 1] by means of the binary representation of numbers in [0, 1] and we use Lebesgue measure on [0, 1] as the probability measure.
منابع مشابه
Random Walks with Anti-Correlated Steps
We conjecture the expected value of random walks with anti-correlated steps to be exactly 1. We support this conjecture with 2 plausibility arguments and experimental data. The experimental analysis includes the computation of the expected values of random walks for steps up to 22. The result shows the expected value asymptotically converging to 1.
متن کاملDensities of short uniform random walks
We study the densities of uniform random walks in the plane. A special focus is on the case of short walks with three or four steps and less completely those with five steps. We also present some new results concerning the moments of uniform random walks, in particular their derivatives.
متن کاملDensities of Short Uniform Random Walks with an appendix
We study the densities of uniform random walks in the plane. A special focus is on the case of short walks with three or four steps and, less completely, those with five steps. As one of the main results, we obtain a hypergeometric representation of the density for four steps, which complements the classical elliptic representation in the case of three steps. It appears unrealistic to expect si...
متن کاملRandom Lazy Random Walks on Arbitrary Finite Groups
This paper considers \lazy" random walks supported on a random subset of k elements of a nite group G with order n. If k = dalog 2 ne where a > 1 is constant, then most such walks take no more than a multiple of log 2 n steps to get close to uniformly distributed on G. If k = log 2 n + f (n) where f (n) ! 1 and f (n)= log 2 n ! 0 as n ! 1, then most such walks take no more than a multiple of (l...
متن کاملProppian random walks in Z
The Propp Machine is a deterministic process that simulates a random walk. Instead of distributing chips randomly, each position makes the chips move according to the walk’s possible steps in a fixed order. A random walk is called Proppian if at each time at each position the number of chips differs from the expected value by at most a constant, independent of time or the initial configuration ...
متن کامل